On algebraic graph theory and non-bijective multivariate maps in cryptography
نویسندگان
چکیده
Special family of non-bijective multivariate maps Fn of Zm n into itself is constructed for n = 2, 3, . . . and compositem. The map Fn is injective on Ωn = {x|x1 + x2 + . . . xn ∈ Zm ∗} and solution of the equation Fn(x) = b, x ∈ Ωn can be reduced to the solution of equation zr = α, z ∈ Zm ∗, (r, φ(m)) = 1. The “hidden RSA cryptosystem” is proposed. Similar construction is suggested for the case Ωn = Zm n.
منابع مشابه
Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces
We perform the asymptotic enumeration of two classes of rooted maps on orientable surfaces:m-hypermaps andm-constellations. Form = 2 they correspond respectively to maps with even face degrees and bipartite maps. We obtain explicit asymptotic formulas for the number of such maps with any finite set of allowed face degrees. Our proofs combine a bijective approach, generating series techniques re...
متن کاملOn New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications
Let K be a general nite commutative ring. We refer to a family gn, n = 1, 2, . . . of bijective polynomial multivariate maps of K as a family with invertible decomposition gn = g ng 2 n . . . g k n, such that the knowledge of the composition of g n allows computation of g i n for O(n ) (s > 0) elementary steps. A polynomial map g is stable if all non-identical elements of kind g, t > 0 are of t...
متن کاملON THE SZEGED INDEX OF NON-COMMUTATIVE GRAPH OF GENERAL LINEAR GROUP
Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...
متن کاملOn Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography
We are going to observe special algebraic Turing machines designed for different assignments of cryptography such as classical symmetric encryption, public key algorithms, problems of secure key exchange, development of hash functions. The security level of related algorithms is based on the discrete logarithm problem (DLP) in Cremona group of free module over finite commutative ring. In the ca...
متن کاملOn two windows multivariate cryptosystem depending on random parameters
The concept of multivariate bijective map of an affine space K over commutative Ring K was already used in Cryptography. We consider the idea of nonbijective multivariate polynomial map Fn of K n into K represented as ”partially invertible decomposition” F (1) n F (2) n . . . F (k) n , k = k(n), such that knowledge on the decomposition and given value u = F (v) allow to restore a special part v...
متن کامل